Certifying Zeros of Polynomial Systems Using Interval Arithmetic

نویسندگان

چکیده

We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has built-in function certify , which proves the correctness of an isolated nonsingular solution to square system polynomial equations. The implementation rests on Krawczyk’s method. demonstrate that it dramatically outperforms earlier approaches certification. see this contribution powerful new geometry, can make default and not just option.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Precise Zeros of Analytic Functions Using Interval Arithmetic

An interval arithmetic algorithm for the computation of the zeros of an analytic function inside a given rectangle is presented. It is based on the argument principle in the set of complex numbers C, is guaranteed to converge, and delivers its answers to a prespecified accuracy. The precision of computation is varied dynamically to maximize efficiency. Предлагается алгоритм на базе интервальной...

متن کامل

Singular Zeros of Polynomial Systems

Singular zeros of systems of polynomial equations constitute a bottleneck when it comes to computing, since several methods relying on the regularity of the Jacobian matrix of the system do not apply when the latter has a non-trivial kernel. Therefore they require special treatment. The algebraic information regarding an isolated singularity can be captured by a finite, local basis of different...

متن کامل

alphaCertified: certifying solutions to polynomial systems

Smale’s α-theory uses estimates related to the convergence of Newton’s method to certify that Newton iterations will converge quadratically to solutions to a square polynomial system. The program alphaCertified implements algorithms based on α-theory to certify solutions of polynomial systems using both exact rational arithmetic and arbitrary precision floating point arithmetic. It also impleme...

متن کامل

An Interval Newton Method Based on the Bernstein Form for Bounding the Zeros of Polynomial Systems

Interval Newton methods are widely used to find reliable enclosures for the roots of the polynomial systems. But the computation process needs the evaluation of an enclosure for the derivative of the polynomial and evaluation of the polynomial at a particular point. Again, the subdivisions (if any are needed) will require repeated evaluation of the function values. We propose an alternative app...

متن کامل

Certifying solutions to square systems of polynomial-exponential equations

Smale’s α-theory certifies that Newton iterations will converge quadratically to a solution of a square system of analytic functions based on the Newton residual and all higher order derivatives at the given point. Shub and Smale presented a bound for the higher order derivatives of a system of polynomial equations based in part on the degrees of the equations. For a given system of polynomial-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Mathematical Software

سال: 2023

ISSN: ['0098-3500', '1557-7295']

DOI: https://doi.org/10.1145/3580277